Computationally highly efficient mixture of adaptive filters
نویسندگان
چکیده
منابع مشابه
Computationally highly efficient mixture of adaptive filters
We introduce a new combination approach for the mixture of adaptive filters based on the set-membership filtering (SMF) framework. We perform SMF to combine the outputs of several parallel running adaptive algorithms and propose unconstrained, affinely constrained and convexly constrained combination weight configurations. Here, we achieve better trade-off in terms of the transient and steadyst...
متن کاملComputationally efficient algorithms for third order adaptive Volterra filters
The input autocorrelation matrix for a third order (cubic) Volterra adaptive filter for general colored Gaussian input processes is analyzed to determine how to best formulate a computationally efftcient fast adaptive algorithm. When the input signal samples are ordered properly within the input data vector, the autocorrelation matrix of the cubic filter inherits a block diagonal structure, wit...
متن کاملComputationally efficient implementation of hypercomplex digital filters
Hypercomplex digital lters have an attractive advantage of the order reduction, however, also have a drawback that multiplication requires a large amount of computations. This paper proposes a novel implementation of hypercomplex digital lters. By decomposing hypercomplex number multiplication, we show that it can be realized as two parallel complex multiplications. Using this technique, any ty...
متن کاملComputationally efficient, one-pass algorithm for morphological filters
Many useful morphological filters are built as long concatenations of erosions and dilations: openings, closings, size distributions, sequential filters, etc. This paper proposes a new algorithm implementing morphological dilation and erosion of functions. It supports rectangular structuring element, runs in linear time w.r.t. the image size and constant time w.r.t. the structuring element size...
متن کاملComputationally Efficient Implementation of Convolution-based Locally Adaptive Binarization Techniques
One of the most important steps of document image processing is binarization. The computational requirements of locally adaptive binarization techniques make them unsuitable for devices with limited computing facilities. In this paper, we have presented a computationally efficient implementation of convolution based locally adaptive binarization techniques keeping the performance comparable to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal, Image and Video Processing
سال: 2016
ISSN: 1863-1703,1863-1711
DOI: 10.1007/s11760-016-0925-2